Extremal distributions of discrepancy functions
نویسندگان
چکیده
منابع مشابه
Extremal functions for sequences
Davenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate repetition and with no alternating subsequence (i.e. of the type ababab . . .) of the length s. This concept based on a geometrical motivation is due to Davenport and Schinzel in the middle of sixties. In the late eighties strong lower and upper (superlinear) bounds on the maximum length of the DS(s) seque...
متن کاملExtremal distributions for tail probabilities of sums
Two old conjectures from problem sections, one of which from SIAM Review, concern the question of finding distributions that maximize P(Sn ≤ t), where Sn is the sum of i.i.d. random variables X1, . . . , Xn on the interval [0, 1], satisfying E [X1] = m. In this paper a Lagrange multiplier technique is applied to this problem, yielding necessary conditions for distributions to be extremal, for a...
متن کاملModeling of Infinite Divisible Distributions Using Invariant and Equivariant Functions
Basu’s theorem is one of the most elegant results of classical statistics. Succinctly put, the theorem says: if T is a complete sufficient statistic for a family of probability measures, and V is an ancillary statistic, then T and V are independent. A very novel application of Basu’s theorem appears recently in proving the infinite divisibility of certain statistics. In addition ...
متن کامل1 Football goal distributions and extremal statistics
We analyse the distributions of the number of goals scored by home teams, away teams, and the total scored in the match, in domestic football games from 169 countries between 1999 and 2001. The probability density functions (PDFs) of goals scored cannot be fitted over their entire ranges by Poisson or negative binomial distributions; here, we compare the PDFs with those arising from extremal st...
متن کاملExtremal functions for rooted minors
The graph G contains a graph H as a minor if there exist pair-wise disjoint sets {Si ⊆ V (G)|i = 1, . . . , |V (H)|} such that for every i, G[Si] is a connected subgraph and for every edge uv in H, there exists an edge of G with one end in Su and the other end in Sv. A rooted H minor in G is a minor where each Si of minor contains a predetermined xi ∈ V (G). We prove that if the constant c is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2019
ISSN: 0885-064X
DOI: 10.1016/j.jco.2019.05.003